A Computational Semantics for Natural Language

نویسندگان

  • Lewis G. Creary
  • Carl Pollard
چکیده

In the new Head-driven Phrase Structure Grammar (HPSG) language processing system that is currently under development at Hewlett-Packard Laboratories, the Montagovian semantics of the earlier GPSG system (see [Gawron et al. 19821) is replaced by a radically different approach with a number of distinct advantages. In place of the lambda calculus and standard first-order logic, our medium of conceptual representation is a new logical for-realism called NFLT (Neo-Fregean Language of Thought); compositional semantics is effected, not by schematic lambda expressions, but by LISP procedures that operate on NFLT expressions to produce new expressions. NFLT has a number of features that make it well-suited {'or natural language translations, including predicates of variable arity in which explicitly marked situational roles supercede order-coded argument positions, sortally restricted quan-tification, a compositional (but nonextensional) semantics that handles causal contexts, and a princip[ed conceptual raising mechanism that we expect to lead to a computation-ally tractable account of propositional attitudes. The use of semantically compositional LiSP procedures in place of lambda-schemas allows us to produce fully reduced translations on the fly, with no need for post-processing. This approach should simplify the task of using semantic information (such as sortal incompatibilities) to eliminate bad parse paths.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What’s behind meaning?

The paper addresses the main questions to be dealt with by any semantic theory which is committed to provide an explanation of how meaning is possible. On one side the paper argues that the resources provided by the development of mathematical logic, theoretical computer science, cognitive psychology, and general linguistics in the 20th Century, however indispensable to investigate the structur...

متن کامل

Towards Foundational Semantics - Ontological Semantics Revisited

In line with Nirenburg and Raskin’s paradigm of ontological semantics, we adhere to the basic tenet that natural language semantics needs to be captured with respect to an explicitly formalized ontology. Many researchers in computational semantics, however, have neglected the ontological aspects of meaning representation, and even more have neglected aspects of meaning representation related to...

متن کامل

Using Situation Theory in a Computational Language for Natural Language Processing

This paper discusses a computational language based on situation theory called astl. Astl is designed as a formal speciication language for contemporary semantic theories of natural language. Descriptions of key aspects of semantic theories may be speciied in astl and then directly executed to derive semantic representations for natural language utterances. We will outline the basic syntax and ...

متن کامل

The key role of semantics in the development of large-scale grammars of natural language

The aim of this paper is to show how large-scale (computational) grammars of natural language benefit from an organization of semantics which is based on Minimal Recursion Semantics (MRS; Copestake et al. (1999)). This we are doing by providing an account of valence alternations in German based on MRS, showing how such an account makes a computational grammar more efficient and less complicated...

متن کامل

Natural Language Semantics and Computability

This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis of the logical models and algorithms currently used in natural language semantics, defined as the mapping of a statement to logical formulas — formulas, because a statement can be ambiguous...

متن کامل

Knowledge Representation for Lexical Semantics: Is Standard First Order Logic Enough?

Many natural language understanding tasks require lexicons that can support extensive lexically-based inferencing. To represent lexical semantics, most existing natural language understanding systems utilize Standard First Order Logic (FOL), or a subset of it. We argue that using a representation richer than FOL would facilitate better lexically-based inferencing. Using examples drawn from actu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1985